Biclique completion problems for multicast network design
نویسندگان
چکیده
منابع مشابه
Biclique completion problems for multicast network design
This paper considers the problem of aggregating several multicast sessions. A multicast session is defined as a subset of clients requiring the same information. Besides, each client can require several multicast sessions. A telecommunication network cannot manage many multicast sessions at the same time. It is hence necessary to group the sessions into a limited number of clusters. The problem...
متن کاملOn Minimizing Multicast Completion Delay for Instantly Decodable Network Coding
In this paper, we consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these...
متن کاملAlgorithms for induced biclique optimization problems
We present polynomial time algorithms for induced biclique optimization problems in the following families of graphs: polygon-circle graphs, 4-hole-free graphs, complements of intervalfilament graphs and complements of subtree-filament graphs. Such problems are to find maximum: induced bicliques, induced balanced bicliques and induced edge bicliques. These problems have applications for bicliqu...
متن کاملTopological Design Comparison for Multicast Network
Since the multicast connection form is clearly di erent from the point-to-point one, the optimal network topology will also be di erent if many multicast services are provided. The Delta-Star topology has been proposed as an e ective topology for a point-to-point network when reliability is a consideration. It may also be e ective for multicast networks, since it is a combined form of the Ring ...
متن کاملApproximating Clique and Biclique Problems
We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.09.005